Automated Composition of Nondeterministic and Partially Observable Stateful Services

In this paper we study the issue of service composition, in the case that services are nondetermistic and partially observable (POTS). In particular, the target service is represented as a finite deterministic transition system, whereas available services are described as finite, nondeterministic and partially observable transition systems. Our aim is, in the first place, to expose a methodology to transform a POTS in a different, but fully observable TS, named KTS, then we show a particular polinomial encoding of this problem in SMV, that allows to solve the problem of composition using the known techinque of reducing the synthesis to the search a safety game winning strategy.